Completely independent spanning trees in some regular graphs
نویسندگان
چکیده
منابع مشابه
Completely Independent Spanning Trees in Some Regular Graphs
Let k ≥ 2 be an integer and T1, . . . , Tk be spanning trees of a graph G. If for any pair of vertices (u, v) of V (G), the paths from u to v in each Ti, 1 ≤ i ≤ k, do not contain common edges and common vertices, except the vertices u and v, then T1, . . . , Tk are completely independent spanning trees in G. For 2k-regular graphs which are 2k-connected, such as the Cartesian product of a compl...
متن کاملCompletely Independent Spanning Trees in Some Regular Networks
Let k ≥ 2 be an integer and T1, . . . , Tk be spanning trees of a graph G.If for any pair of vertices (u, v) of V (G), the paths from u to v in each Ti,1 ≤ i ≤ k, do not contain common edges and common vertices, except thevertices u and v, then T1, . . . , Tk are completely independent spanningtrees in G. For 2k-regular graphs which are 2k-connected, such as theCartesian pro...
متن کاملSpanning Trees in Regular Graphs
Let X be a regular graph with degree k 2 3 and order n. Then the number of spanning trees of X is where yk, ck and (3,,k(l/k) are positive constants, and p, is the number of equivalence classes of certain closed walks of length i in X. The value (k-l)k-l Ck = (k2_2k)"i/2)-l is shown to be the best possible in the sense that K(x~)"" +c^ for some increasing sequence X,, X2,.. . of regular graphs ...
متن کاملTwo counterexamples on completely independent spanning trees
For each k ≥ 2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example for a 3-connected maximal plane graph not containing two completely independent spanning trees.
متن کاملCompletely independent spanning trees in (partial) k-trees
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that ⌈k/2⌉ ≤ cist(G) ≤ k − 1 for any k-tree G. Then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.09.007